Uniformly connected graphs
نویسندگان
چکیده
In this article, we investigate the structure of uniformly k $k$ -connected and -edge-connected graphs. Whereas both types have previously been studied independent each other, analyze relations between these two classes. We prove that any graph is also for ≤ 3 $k\le 3$ demonstrate not case > $k\gt . Furthermore, graphs are well understood 2 2$ it known how to construct 3-edge-connected contribute here a constructive characterization 3-connected inspired by Tutte's Wheel Theorem. Eventually, results help us tight bound on number vertices minimum degree in
منابع مشابه
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, i.e., we count connected cubic planar graphs up to isomorphisms that fix a certain directed edge. Based on decompositions along the connectivity structure, we derive recurrence formulas for the exact number of rooted ...
متن کاملObtaining Uniformly Dense Graphs
Let G be a non-trivial, loop-less multi-graph and for each non-trivial sub-graph H of G, let g(H) = |E(H)| |V (H)|−ω(G) . G is said to be uniformly dense if and only if γ(G), the maximum among g(H) taken over all non-trivial subgraphs H of G is attained when H = G. This quantity γ(G) is called the fractional arboricity of G and was introduced by Catlin, Grossman, Hobbs and Lai [4]. γ(G)− g(G) m...
متن کاملUniformly cordial graphs
LetG be a graph with vertex set V (G) and edge setE(G). A labeling f : V (G) → {0, 1} induces an edge labeling f ∗ : E(G) → {0, 1}, defined by f ∗(xy) = |f (x) − f (y)| for each edge xy ∈ E(G). For i ∈ {0, 1}, let ni(f ) = |{v ∈ V (G) : f (v) = i}| and mi(f )=|{e ∈ E(G) : f ∗(e)= i}|. Let c(f )=|m0(f )−m1(f )|.A labeling f of a graphG is called friendly if |n0(f )−n1(f )| 1. A cordial labeling ...
متن کاملOn uniformly balanced graphs
Let G = (V, E) be a simple graph. A vertex labeling f : V → {0, 1} induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) 84 KWONG, LEE, LO, SU AND WANG if and only if f(u) = f(v). For i = 0, 1, let vf(i) = |{v ∈ V : f(v) = i}|, and ef (i) = |{e ∈ E : f ∗(e) = i}|. A graph G is uniformly balanced if |ef (0)−ef (1)| ≤ 1 for any vertex labeling f that satisfies |vf(0)−vf (1)| ...
متن کاملGenerating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non necessarily connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22820